Concentration inequalities for functions of independent variables
نویسندگان
چکیده
منابع مشابه
Concentration inequalities for functions of independent variables
Following the entropy method this paper presents general concentration inequalities, which can be applied to combinatorial optimization and empirical processes. The inequalities give improved concentration results for optimal travelling salesmen tours, Steiner trees and the eigenvalues of random symmetric matrices. 1 Introduction Since its appearance in 1995 Talagrands convex distance inequali...
متن کاملConcentration and moment inequalities for polynomials of independent random variables
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables including Gaussian, Boolean, exponential, Poisson and many others. We apply our method to derive general concentration inequalities for polynomials of independent random variables. We show that our method implies concentra...
متن کاملMoment inequalities for functions of independent random variables
A general method for obtaining moment inequalities for functions of independent random variables is presented. It is a generalization of the entropy method which has been used to derive concentration inequalities for such functions [7], and is based on a generalized tensorization inequality due to Lata la and Oleszkiewicz [25]. The new inequalities prove to be a versatile tool in a wide range o...
متن کاملEntropy-Based Concentration Inequalities for Dependent Variables
We provide new concentration inequalities for functions of dependent variables. The work extends that of Janson (2004), which proposes concentration inequalities using a combination of the Laplace transform and the idea of fractional graph coloring, as well as many works that derive concentration inequalities using the entropy method (see, e.g., (Boucheron et al., 2003)). We give inequalities f...
متن کاملSharp Concentration Inequalities for Deviations from the Mean for Sums of Independent Rademacher Random Variables
For a fixed unit vector a= (a1, a2, . . . , an) ∈ Sn−1, that is, ∑i=1 ai = 1, we consider the 2n signed vectors ε = (ε1, ε2, . . . , εn) ∈ {−1, 1}n and the corresponding scalar products a · ε = ∑i=1 aiεi. In [3] the following old conjecture has been reformulated. It states that among the 2n sums of the form ∑±ai there are not more with ∣ ∣∑i=1±ai ∣ ∣ > 1 than there are with ∣ ∣∑i=1±ai ∣ ∣≤ 1. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 2006
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.20105